The Genetic Algorithm and Local Optimizer Hybrid Approach for the AdvancedLayout Problem
ثبت نشده
چکیده
Spatial layout problems aaect architects, physicists and many other professionals in their attempts to streamline factory designs, nd optimal molecular con-gurations or arrange components for micro-circuitry design. Although genetic algorithms have been used successfully in many of these areas, certain aspects of these problems still represent a major challenge for the GA community. This paper discusses the problems of adding heterogeneous objects, continuous placement and forbidden zones to the general layout problem. The factory oor layout problem is used as an example of the eeect and problems of dealing with these extensions. Results are achieved through the use of an iterative local optimizer and a genetic algorithm.
منابع مشابه
Preventing Instability Phenomenon in Gas-lift Optimization
One of the problems that sometimes occur in gas allocation optimization is instability phenomenon. This phenomenon reduces the oil production and damages downhole and surface facilities. Different works have studied the stability and suggested some solutions to override it, but most of them (such as making the well intelligent) are very expensive and thus they are not applicable to many cases. ...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملA Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملSolving the flexible job shop problem by hybrid metaheuristics-based multiagent model
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...
متن کاملA Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کامل